Network intent synthesis

ABSTRACT

A processing system may obtain an intent comprising a desired network state for a telecommunication network, determine an existing network state, where the desired network state and the existing network state are defined in accordance with a graph representing the telecommunication network, where the graph includes objects and relationships between the plurality of objects, and where each of the objects includes one or more properties. The processing system may compose a strategy that includes a plurality of policies to obtain the desired network state from the existing network state, where each of the policies comprises an action that is to be implemented in the telecommunication network, where the composing comprises performing a state exploration process over the graph, and where each state transition of the process corresponds to one of the policies. The processing system may then implement the strategy to place the telecommunication network in the desired network state.

The present disclosure relates generally to telecommunication networkoperations, and more particularly to methods, computer-readable media,and apparatuses for implementing a plurality of policies according to astrategy composed in accordance with a state exploration process toplace a telecommunication network in a desired network state.

BACKGROUND

Currently if network operators want a network to behave in a certainway, they need to design a set of low level policies or control loops.An example of desired behavior is that certain cells of a base stationshould be powered down to save energy cost when there is less traffic.If an operator wants to achieve this in a cellular network, the operatormay manually create a set of low level policies and then decide when andin what order these policies should be applied. This process is onerous,requiring a lot of time and effort. It is also error prone because theoperator may have no formal way to guarantee that a selected set ofpolicies will achieve a desired behavior.

SUMMARY

Examples of the present disclosure include methods, computer-readablemedia, and apparatuses for implementing a plurality of policiesaccording to a strategy composed in accordance with a state explorationprocess to place a telecommunication network in a desired network state.For instance, in one example, a processing system including at least oneprocessor may obtain a selection of an intent comprising a desirednetwork state for a telecommunication network, determine an existingnetwork state of the telecommunication network, where the desirednetwork state and the existing network state are defined in accordancewith a graph that represents the telecommunication network, where thegraph comprises a plurality of objects and a plurality of relationshipsbetween the plurality of objects, and where each of the plurality ofobjects comprises one or more properties. The processing system mayfurther compose a strategy that includes a plurality of policies toobtain the desired network state from the existing network state, whereeach of the plurality of policies comprises an action that is to beimplemented in the telecommunication network, where the composingcomprises performing a state exploration process over the graph, andwhere each state transition of a plurality of state transitions of thestate exploration process corresponds to a policy of the plurality ofpolicies. The processing system may then implement the plurality ofpolicies according to the strategy, where the implementing is to placethe telecommunication network in the desired network state.

BRIEF DESCRIPTION OF THE DRAWINGS

The present disclosure can be readily understood by considering thefollowing detailed description in conjunction with the accompanyingdrawings, in which:

FIG. 1 illustrates an example of a system including a telecommunicationsservice provider network, according to the present disclosure;

FIG. 2 illustrates an example graph representing a telecommunicationnetwork, according to the present disclosure;

FIG. 3 illustrates an example of a state exploration process, accordingto the present disclosure;

FIG. 4 illustrates a flowchart of an example method for implementing aplurality of policies according to a strategy composed in accordancewith a state exploration process to place a telecommunication network ina desired network state; and

FIG. 5 illustrates a high-level block diagram of a computing devicespecifically programmed to perform the functions described herein.

To facilitate understanding, identical reference numerals have beenused, where possible, to designate identical elements that are common tothe figures.

DETAILED DESCRIPTION

Examples of the present disclosure include methods, non-transitory(i.e., tangible and/or physical) computer-readable media, andapparatuses for implementing a plurality of policies according to astrategy composed in accordance with a state exploration process toplace a telecommunication network in a desired network state. Inparticular, examples of the present disclosure provide automated networkintent verification which includes several aspects. For instance, in oneaspect a network domain is described as an graph (e.g., an entityrelationship graph), in which the graph includes objects (e.g.,entities) representing components of a telecommunication network, and inwhich each of the objects has properties (which may includeconfigurations or settings), and relationships among the objects,representing the connections and associations among the objects (e.g.,links in the telecommunication network, or the network topology, as wellas hierarchical relationships, such as management relationships,host/guest relationships, etc., functional/logical relationships, and soforth). Thus, such a graph represents the network state and topology ofthe telecommunication network. In one example, the present disclosureincludes a schema to declaratively describe intents as logical formulasfor the desired state of the telecommunication network.

In addition, in one example, the present disclosure includes a stateexploration process to select a strategy comprising a set of policiesfrom a knowledge-base, and a plan on when and how to apply thesepolicies. In one example, the present disclosure further includes amethodology to formally guarantee that the set of policies/strategy willachieve the desired intent. For instance, the present disclosure mayinclude a pre-defined knowledge base with policies (e.g., low-level,and/or atomic policies) and domain information about thetelecommunication network. For instance, the policies may be created byexperts or auto-generated. Examples of domain information may be a listof virtual machines (VMs) and zone/region for each virtual networkfunction (VNF), radio information about each eNodeB (eNB), etc. In oneexample, the domain information may be derived from network inventorysystems like an active and available inventory (A&AI) system, or thelike.

Examples of the present disclosure enable network operators, clients,and end-users to specify desired network behavior without havingdetailed domain knowledge. Manually creating and managing policies andpolicy strategies (deciding on which policies to apply and in whatorder) to achieve high-level intent is a complex task, which may requirea skilled individual, who not only understands the network but who alsohas experience in policy specification systems and who can apply logicto make sure that the interactions of low-level policies have a desiredeffect. In contrast, examples of the present disclosure enable operatorsto specify an intent in a high-level language, and the system willautomatically generate a strategy composed of policies, and execute thestrategy to achieve the intent. In one example, the present disclosurefacilitates dynamic changes in the high-level intent (e.g., in responseto changes in the network domain and conditions) and provides forefficient and safe use of policies within the telecommunication network.Examples of the present disclosure may also reduce errors because theautomation may guarantee that the selected policies achieve the intentand do not have any undesired side-effects. These and other aspects ofthe present disclosure are discussed in greater detail below inconnection with the examples of FIGS. 1-5.

To better understand the present disclosure, FIG. 1 illustrates anexample network, or system 100 in which examples of the presentdisclosure may operate. In one example, the system 100 includes atelecommunication service provider network 170. The telecommunicationservice provider network 170 may comprise a cellular network 101 (e.g.,a 4G/Long Term Evolution (LTE) network, a 4G/5G hybrid network, or thelike), a service network 140, and a core network, e.g., an IP MultimediaSubsystem (IMS) core network 115. The system 100 may further includeother networks 180 connected to the telecommunication service providernetwork 170. FIG. 1 also illustrates various mobile endpoint devices,e.g., user equipment (UE) 116 and 117. The UE 116 and 117 may eachcomprise a cellular telephone, a smartphone, a tablet computing device,a laptop computer, a pair of computing glasses, a wireless enabledwristwatch, or any other cellular-capable mobile telephony and computingdevices (broadly, “a mobile endpoint device”).

In one example, the cellular network 101 comprises an access network 103and a core network, Evolved Packet Core (EPC) network 105. In oneexample, the access network 103 comprises a cloud RAN. For instance, acloud RAN is part of the 3rd Generation Partnership Project (3GPP) 5Gspecifications for mobile networks. As part of the migration of cellularnetworks towards 5G, a cloud RAN may be coupled to an EPC network untilnew cellular core networks are deployed in accordance with 5Gspecifications. In one example, access network 103 may include cellsites 111 and 112 and a baseband unit (BBU) pool 114. In a cloud RAN,radio frequency (RF) components, referred to as remote radio heads(RRHs) (e.g., including antennas), may be deployed remotely frombaseband units, e.g., atop cell site masts, buildings, and so forth. Inone example, the BBU pool 114 may be located at distances as far as20-80 kilometers or more away from the antennas/remote radio heads ofcell sites 111 and 112 that are serviced by the BBU pool 114. It shouldalso be noted in accordance with efforts to migrate to 5G networks, cellsites may be deployed with new antenna and radio infrastructures such asmultiple input multiple output (MIMO) antennas, and millimeter waveantennas. In this regard, a cell, e.g., the footprint or coverage areaof a cell site, may in some instances be smaller than the coverageprovided by NodeBs or eNodeBs of 3G-4G RAN infrastructure. For example,the coverage of a cell site utilizing one or more millimeter waveantennas may be 1000 feet or less.

Although cloud RAN infrastructure may include distributed RRHs andcentralized baseband units, a heterogeneous network may include cellsites where RRH and BBU components remain co-located at the cell site.For instance, cell site 113 may include RRH and BBU components. Thus,cell site 113 may comprise a self-contained “base station.” With regardto cell sites 111 and 112, the “base stations” may comprise RRHs at cellsites 111 and 112 coupled with respective baseband units of BBU pool114. In accordance with the present disclosure, any one or more of cellsites 111-113 may be deployed with antenna and radio infrastructures,including multiple input multiple output (MIMO) and millimeter waveantennas. In one example, any one or more of cell sites 111-113 maycomprise one or more directional antennas (e.g., capable of providing ahalf-power azimuthal beamwidth of 60 degrees or less, 30 degrees orless, 15 degrees or less, etc.). In one example, any one or more of cellsites 111-113 may comprise a 5G “new radio” (NR) base station.

In one example, the EPC network 105 provides various functions thatsupport wireless services in the LTE environment. In one example, EPCnetwork 105 is an Internet Protocol (IP) packet core network thatsupports both real-time and non-real-time service delivery across a LTEnetwork, e.g., as specified by the 3GPP standards. In one example, cellsites 111 and 112 in the access network 103 are in communication withthe EPC network 105 via baseband units in BBU pool 114. In operation, UE116 may access wireless services via the cell site 111 and UE 117 mayaccess wireless services via the cell site 112 located in the accessnetwork 103. It should be noted that any number of cell sites can bedeployed in access network. In one illustrative example, the accessnetwork 103 may comprise one or more cell sites.

In EPC network 105, network devices such as Mobility Management Entity(MME) 107 and Serving Gateway (SGW) 108 support various functions aspart of the cellular network 101. For example, MME 107 is the controlnode for the LTE access network. In one embodiment, MME 107 isresponsible for UE (User Equipment) tracking and paging (e.g., such asretransmissions), bearer activation and deactivation process, selectionof the SGW, and authentication of a user. In one example, SGW 108 routesand forwards user data packets, while also acting as the mobility anchorfor the user plane during inter-cell handovers and as the anchor formobility between 5G, LTE and other wireless technologies, such as 2G and3G wireless networks.

In addition, EPC network 105 may comprise a Home Subscriber Server (HSS)109 that contains subscription-related information (e.g., subscriberprofiles), performs authentication and authorization of a wirelessservice user, and provides information about the subscriber's location.The EPC network 105 may also comprise a packet data network (PDN)gateway 110 which serves as a gateway that provides access between theEPC network 105 and various data networks, e.g., service network 140,IMS core network 115, other network(s) 180, and the like. The packetdata network gateway 110 is also referred to as a PDN gateway, a PDN GWor a PGW. In addition, the EPC network 105 may include a DiameterRouting Agent (DRA) 106, which may be engaged in the proper routing ofmessages between other elements within EPC network 105, and with othercomponents of the system 100, such as a call session control function(CSCF) (not shown) in IMS core network 115. For clarity, the connectionsbetween DRA 106 and other components of EPC network 105 are omitted fromthe illustration of FIG. 1.

In one example, service network 140 may comprise one or more devices,such as application server (AS) 145 for providing services to othercomponents of telecommunication service provider network 170, to networkoperations personnel, to subscribers, customers, and/or end-users, andso forth. For example, telecommunication service provider network 170may provide a cloud storage service, web server hosting, and otherservices. As such, service network 140 may represent aspects oftelecommunication service provider network 170 where infrastructure forsupporting such services may be deployed. In one example, AS 145 maycomprise all or a portion of a computing device or system, such ascomputing system 500, and/or processing system 502 as described inconnection with FIG. 5 below, specifically configured to perform variousoperations for implementing a plurality of policies according to astrategy composed in accordance with a state exploration process toplace a telecommunication network in a desired network state, inaccordance with the present disclosure. For instance, and example methodfor implementing a plurality of policies according to a strategycomposed in accordance with a state exploration process to place atelecommunication network in a desired network state is illustrated inFIG. 4 and described in greater detail below. Although a singleapplication server, AS 145, is illustrated in service network 140, itshould be understood that service network 140 may include any number ofcomponents to support one or more services that may be provided by thetelecommunication service provider network 170.

In addition, it should be noted that as used herein, the terms“configure,” and “reconfigure” may refer to programming or loading aprocessing system with computer-readable/computer-executableinstructions, code, and/or programs, e.g., in a distributed ornon-distributed memory, which when executed by a processor, orprocessors, of the processing system within a same device or withindistributed devices, may cause the processing system to perform variousfunctions. Such terms may also encompass providing variables, datavalues, tables, objects, or other data structures or the like which maycause a processing system executing computer-readable instructions,code, and/or programs to function differently depending upon the valuesof the variables or other data structures that are provided. As referredto herein a “processing system” may comprise a computing deviceincluding one or more processors, or cores (e.g., as illustrated in FIG.5 and discussed below, and which may include central processing units(CPUs), graphics processing units (GPUs), programmable logic devices(PLDs), and so forth) or multiple computing devices collectivelyconfigured to perform various steps, functions, and/or operations inaccordance with the present disclosure.

In one example, other networks 180 may represent one or more enterprisenetworks, a circuit switched network (e.g., a public switched telephonenetwork (PSTN)), a cable network, a digital subscriber line (DSL)network, a metropolitan area network (MAN), an Internet service provider(ISP) network, and the like. In one example, the other networks 180 mayinclude different types of networks. In another example, the othernetworks 180 may be the same type of network. In one example, the othernetworks 180 may represent the Internet in general.

In accordance with the present disclosure, any one or more of thecomponents of EPC network 105 may comprise a network functionvirtualization infrastructure (NFVI), e.g., SDN host devices (i.e.,physical devices) configured to operate as various virtual networkfunctions (VNFs), such as a virtual MME (vMME), a virtual HHS (vHSS), avirtual serving gateway (vSGW), a virtual packet data network gateway(vPGW), and so forth. For instance, MME 107 may comprise a vMME, SGW 108may comprise a vSGW, and so forth. In this regard, the EPC network 105may be expanded (or contracted) to include more or less components thanthe state of EPC network 105 that is illustrated in FIG. 1. In thisregard, the EPC network 105 may also include a network controller 102,e.g., a self-optimizing network (SON) and/or a software defined network(SDN) controller. For instance, in one example network controller 102may function as a self-optimizing network (SON) orchestrator that isresponsible for activating and deactivating, allocating anddeallocating, and otherwise managing a variety of network components. Inone example, network controller may further comprise a SDN controllerthat is responsible for instantiating, configuring, managing, andreleasing VNFs. For example, in a SDN architecture, a SDN controller mayinstantiate VNFs on shared hardware, e.g., NFVI/host devices/SDN nodes,which may be physically located in various places.

In one example, telecommunication service provider network 170 furtherincludes an active and available inventory (A&AI) system 150. The A&AIsystem 150 may comprise a computing system or server, such as computingsystem 500 depicted in FIG. 5, and may be configured to provide one ormore operations or functions in connection with examples of the presentdisclosure for implementing a plurality of policies according to astrategy composed in accordance with a state exploration process toplace a telecommunication network in a desired network state. In oneexample, A&AI system 150 may comprise a distributed data storage and/orprocessing system comprising one or more servers at a same location orat different locations, e.g., a Hadoop® Distributed File System (HDFS™),or the like.

For instance, A&AI system 150 may obtain network topology information(e.g., connectivity information), as well as services and resourcesinformation for various physical and virtual components oftelecommunication service provider network 170. The data gathered andstored by A&AI system 150 may be obtained from various devices in thetelecommunication service provider network 170. For instance, thecomponents may send attributes and connectivity information to A&AIsystem 150. In one example, the components may send attributes andconnectivity information to aggregation points, which may forward theattributes and connectivity information to A&AI system 150.

In one example, the A&AI system 150 may store gathered information in agraph (e.g., a graph database). In one example, the graph may beconstructed and maintained by the A&AI system 150 in accordance with aschema, e.g., a set of rules regarding the types of nodes/vertices inthe graph database (broadly “objects”) and the attributes of thenodes/vertices, the types of relationships between nodes/vertices, thetypes of properties and labels that may be associated withnodes/vertices and the relationships, and so forth. The schema may alsobe defined to imply a hierarchy of nodes/vertices. For instance,nodes/vertices may be arranged in layers/levels, such as cloud regions,rack tenants, physical servers, and virtual machines (VMs) (such asVNFs), where rack tenants may be child nodes/vertices of cloud regions,physical services may be child nodes/vertices of rack tenants, and soforth. Thus, for example, when a new VNF is instantiated on a hostdevice by network controller 102 (e.g., as an SDN controller), the A&AIsystem 150 may receive notification of the new VNF. For instance, thenotification may come from the host device, from network controller 102,from an aggregation point, etc.

The A&AI system 150 may then create a new vertex in the graph for theVNF and add the vertex in the appropriate position in the graph (e.g.,the graph database). For example, the vertex for the VNF may be added asa child of a vertex for the host device (e.g., a physical server) inaccordance with the schema. For instance, an edge between the vertex forthe host device and the vertex for the VNF may include the label “ischild of” or “is hosted on.” The A&AI system 150 may perform similaroperations to remove nodes/vertices and edges (e.g., when a VNF isreleased, when a physical server is removed from service, etc.), toupdate edges (e.g., when two physical servers in operation obtain a newconnection, when a bandwidth between physical servers is increased,etc.), to update nodes (e.g., when additional memory, processorresources, storage resources, or the like are added or when suchresources are removed), and so on.

In one example, AS 145 may obtain performance indicators directly fromRAN components (e.g., from access network 103, etc.) and/or from othercomponents of telecommunication service provider network 170. Forinstance, eNodeBs may collect performance indicators which may beobtained via vendor API(s) via push or pull functions. The performanceindicators may be further processed, for instance, by averaging,sampling, etc. The respective performance indicators, as obtained fromthe RAN or other network component(s) and/or as further processed, maythen be utilized as state information, depending upon the particular usecases and the configuration(s) of AS 145, network controller 102, A&AIsystem 150, etc.

As noted above, AS 145 may perform operations for implementing aplurality of policies according to a strategy composed in accordancewith a state exploration process to place a telecommunication network ina desired network state, as described herein. To illustrate, in oneexample, AS 145 may obtain from A&AI system 150 a graph (e.g., a graphdatabase) representing telecommunication service provider network 170(or at least a portion thereof, such as both access network 103 and EPCnetwork 105, or access network 103 individually, EPC network 105individually, IMS core network 115 individually, etc.). In one example,AS 145 may update and/or modify the graph, or create a new graph basedupon the graph obtained from A&AI system 150 to additionally includestate information relating to various aspects of the telecommunicationservice provider network 170, e.g., as “properties” of various“objects.” For instance, in one example, AS 145 may obtain stateinformation from any one or more of cell sites 111-113 in access network103 (e.g., a radio access network (RAN)), from any one or more devicesin EPC network 105, IMS core network 115, etc.

In one example, the state information may comprise current settings ofvarious configurable parameters of various components. The variousparameters may include cell site scheduling options (e.g., choices amongMedia Access Control (MAC) scheduling algorithms), cell handover offset(HO) configurations, sector tilt, power on/off settings for cells,sectors, and/or RRHs, a number of BBUs (e.g., from BBU pool 114), and soon. The state information may also include statuses of whether certainactions have been performed, such as: “pre-processed” or “notpre-processed,” to indicate whether a cell has been preprocessed via apreprocess policy/action, “cell tagged” or “not cell tagged” to indicatewhether a cell has been tagged via a cell tag policy/action, “cellreconfigured” or “cell not reconfigured” to indicate whether a cell hasbeen reconfigured via a cell reconfiguration policy/action, “sectortagged” or “not sector tagged” to indicate whether a sector has beentagged via a sector tag policy/action, a “sleep optimized” or “not sleepoptimized” tag to indicate whether a sector has been sleep-optimized viaa sleep optimization policy/action, and so forth.

In one example, the state information may also include performanceindicators associated with various “objects” in the graph (e.g.,components, groups of components, regions, etc.), including cell levelperformance indicators, such as throughput, uplink and/or downlinkvolume/throughput, video user downlink throughput (video specific),radio frequency (RF) conditions, physical resource block (PRB) and/orcontrol channel element (CCE) utilization, active UEs, neighborrelations, handovers, frequency, bandwidth, user geographicdistribution, historical information, reference signal received power(RSRP), reference signal received quality (RSRQ), and/or channel qualityinformation (CQI) distribution, timing advance (TA) distribution, cellbitrate, harmonic UE throughput, throughput gap (difference betweenmaximum and minimum UE throughputs), worst throughput, cluster harmonicthroughput, a weighted sum of the foregoing, etc.

In one example, the present disclosure may utilize a data streamingplatform for distributing state information, e.g., to one or moresystem, such as AS 145. For instance, Apache Kafka (herein referred toas Kafka) is a streaming platform that enables applications to streammessages to “topics.” Topics in Kafka are message queues where eachmessage being published to the topic is published to all theapplications that are subscribed to the topic. These publishers act asproducers, and the subscribers are consumers. Such producers andconsumers may be arranged to build complex real-time streaming datapipeline architectures. Thus, components of telecommunication serviceprovider network 170 may comprise “producers” (e.g., the componentsthemselves, or aggregation points) and AS 145 may comprise at least one“consumer.”

In one example, AS 145 may store predefined policies (e.g., each of theplurality of policies having a “precondition” and a “post-condition”)and predefined intents. For instance, the predefined policies mayinclude: a preprocess policy, a cell tag policy, a cell reconfigurationpolicy, a sector tag policy, a sleep optimization policy, and so forth.In one example, each of the preconditions and post-conditions is definedas logical expression comprising a predicate on a domain represented bythe graph or a literal on the domain represented by the graph (e.g., apredicate may comprise a Boolean expression with variables comprisinginformation taken from the graph (e.g., representing network state),while a literal may comprise an atomic formula (or its negation), whichin one example, can be a predicate symbol applied to terms/variablesfrom the graph information). In addition, each of the policies maycomprise an action (e.g., an automated action) that may be implementedin the telecommunication network. In particular, the actions may includeatomic actions, e.g., configuration options/settings for differentconfigurable parameters of the RAN, including: MAC scheduler algorithms,handover offsets, power on/off, transmit power, tilt, etc. In oneexample, the actions may include a plurality of sub-policies/sub-actions(broadly “a set of actions”) to be performed as a group. For instance,each sub-policy/sub-action may itself comprise an atomic action, or asequence of multiple atomic actions. In any case, the availablepolicies/actions that may be selected by AS 145 may be predefined, e.g.,by network operations personnel, where each available policy/action hasa “signature” defined by a “precondition” and a “post-condition.” Forexample, a sector tag policy may have a precondition of tagged(cell) anda post-condition of tagged(sector). In other words, in order for thesector tag policy to be invoked, the cell tag policy may first beperformed in order for tagged(cell) to be true, upon which the sectortag policy is a viable action. Otherwise, the sector tag policy may notbe invoked since the precondition is not true.

Similarly, AS 145 may store predefined intents, which are high-level (orat least higher-level) goals that may be achieved via utilization ofmultiple policies. The intents may be, for example: “energy savings,”“coverage optimization,” “traffic offload,” “blacklisting,”“safe-guard,” “reboot,” and so forth. In one example, the intents may bedefined by a desired network state (e.g., characteristics of thetelecommunication service provider network 170) as represented by astate of the graph representing the telecommunication service providernetwork 170. In one example, the available intents may also be definedby a level of the intent, such as conservative-moderate-aggressive, arange or level between 1-5, a range or level between 1-10, etc. Forinstance, a first available intent may comprise “conservative energysavings” while a second available intent may comprise “aggressive energysavings.” In one example, network operations personnel may select anddeploy intents via user terminals in communication with AS 145. Forinstance, in one example, a user, e.g., network operations personnel,may select an intent from the available intents, e.g., via a userinterface at terminal 147 and convey the intent to AS 145. AS 145 maythen compose a strategy comprising a set, or sequence, of policies fromamong the available policies, to achieve the intent. For example, AS 145may apply a state exploration process, such as described below andillustrated in FIG. 3.

In one example, the state exploration process may be implemented via asatisfiability modulo theories (SMT) solver, such as Stanford ResearchInstitute Problem Solver (STRIPS), a CVC3 solver, a CVC4 solver, aSATPLAN solver, a BLACKBOX solver, a Graphplan solver, or the like. Thestates to be explored are possible states of the graph representing thetelecommunication service provider network 170 (or at least the portionthereof) and the possible transitions between states correspond to theavailable policies/actions. In one example, the state explorationprocess begins with an existing network state as known to AS 145. Thepossible states (e.g., simulated network states) that are visited viathe state exploration process may include changes as indicated by therespective policies/actions, e.g., for each state change correspondingto a considered policy/action, the respective post-condition for thepolicy/action becomes true. In one example, the state explorationprocess ends when a simulated network state is obtained that comprisesthe desired network state as defined by the selected intent. The resultof the state exploration process is a strategy which can place thetelecommunication service provider network 170 in the desired networkstate according to the intent, e.g., starting from the existing networkstate and applying the sequence/set of policies according to thestrategy.

In one example, AS 145 may apply the strategy, e.g., the set/sequence ofpolicies in the determined order, via one or more instructions tonetwork controller 102. For instance, AS 145 may communicate withnetwork controller 102 to provide one or more instructions to implementthe set of policies, where the network controller 102 may communicatewith cell sites 111-113 and/or any one or more components thereof, suchas eNodeB's, remote radio heads (RRHs), BBU pool 114, etc. via one ormore respective control interfaces (e.g., vendor APIs) to remotelyadjust settings for various configurable parameters in accordance withthe policies/actions. For instance, one possible action may be aselection from among five different scheduling algorithms that areavailable to apply at a cell site (e.g., at an eNodeB). For instance,five vendor-provided scheduling algorithms (e.g., MAC schedulingalgorithms) may broadly comprise different strategies for balancingbetween fairness and efficiency. Other actions may comprising changing,setting, and/or confirming power on/off options for one or more of cellsites 111-113, the number of active RRHs and/or BBUs from BBU pool 114,tilt angles for RRHs, etc. Actions may relate to configurable parametershaving discrete action spaces (e.g., on-off, high-medium-low, etc.), orcontinuous action spaces (e.g., tilt angles ranging from 0 to 20degrees, transmitter power from 10-50 dBm, handover offsets, etc.). Itshould be noted that the network operations personnel who may select theintent via terminal 147 may not be required to have detailedimplementation and/or domain knowledge such as possessed by the networkoperations personnel who may define the policies and intents. Rather,the network operations personnel selecting the intent may more simplychoose from among available options via a user interface, and the AS 145(and/or AS 145 in conjunction with other components of telecommunicationservice provider network 170) may determine how to achieve the intent,and may automatically execute the strategy to do so.

The foregoing description of the system 100 is provided as anillustrative example only. In other words, the example of system 100 ismerely illustrative of one network configuration that is suitable forimplementing examples of the present disclosure. As such, other logicaland/or physical arrangements for the system 100 may be implemented inaccordance with the present disclosure. In one example, the system 100may be expanded to include additional networks, such as networkoperations center (NOC) networks, additional access networks, and soforth. The system 100 may also be expanded to include additional networkelements such as border elements, routers, switches, policy servers,security devices, gateways, a content distribution network (CDN) and thelike, without altering the scope of the present disclosure. In addition,system 100 may be altered to omit various elements, substitute elementsfor devices that perform the same or similar functions, combine elementsthat are illustrated as separate devices, and/or implement networkelements as functions that are spread across several devices thatoperate collectively as the respective network elements.

For instance, in one example, network controller 102 may be spilt intoseparate components to operate as a SON orchestrator and a SDNcontroller, respectively. Similarly, although the network controller 102is illustrated as a component of EPC network 105, in another examplenetwork controller 102, and/or other network components may be deployedin an IMS core network 115 instead of being deployed within the EPCnetwork 105, or in other portions of system 100 that are not shown,while providing essentially the same functionality. Similarly, AS 145may be alternatively deployed as an additional component of EPC network105, access network 103, etc. In on example, functions of differentcomponents may be combined into a single device, or into a lesser numberof devices than as shown in FIG. 1, or may be distributed among aplurality of physical devices which collectively provide the abovefunctions of AS 145. For instance, in one example, AS 145 may representa processing system comprising a plurality of devices to collectivelyperform operations for implementing a plurality of policies according toa strategy composed in accordance with a state exploration process toplace a telecommunication network in a desired network state, asdescribed herein. In one example, functions described above with regardto AS 145 may alternatively or additionally be performed by networkcontroller 102. For example, network controller 102 may include a SMTsolver to obtain a graph representing telecommunication service providernetwork 170 and an intent, and to determine and implement a strategycomprising a set/sequence of policies, e.g., addition to other functionsof network controller 102.

In still another example, it should be noted that AS 145 may bedesignated for a particular zone or region of telecommunication serviceprovider network 170. For instance, different application servers may beassigned with similar functions and responsibilities for generatingstrategies and fulfilling intents with regard to different networkslices, e.g., different access networks, different portions of EPCnetwork 105 (e.g., different MMEs, SGWs, etc.), and so forth. Forinstance, application servers for implementing a plurality of policiesaccording to a strategy composed in accordance with a state explorationprocess to place a telecommunication network in a desired network statemay be deployed on a per-zone, per-region basis, e.g., corresponding to10 cells, a county, a state, etc. In such an example, network state maybe tracked per-zone/per-region, and intents may be specified andfulfilled on such a per-zone/per-region basis.

In addition, although aspects of the present disclosure have beendiscussed above in the context of a long term evolution (LTE)-based corenetwork (e.g., EPC network 105), examples of the present disclosure arenot so limited. For example, as illustrated in FIG. 1, the cellularnetwork 101 may represent a “non-stand alone” (NSA) mode architecturewhere 5G radio access network components, such as a “new radio” (NR),“gNodeB” (or “gNB”), and so forth are supported by a 4G/LTE core network(e.g., a Evolved Packet Core (EPC) network 105). However, in anotherexample, system 100 may instead comprise a 5G “standalone” (SA) modepoint-to-point or service-based architecture where components andfunctions of EPC network 105 are replaced by a 5G core network, whichmay include an access and mobility management function (AMF), a userplane function (UPF), a session management function (SMF), a policycontrol function (PCF), a unified data management function (UDM), anauthentication server function (AUSF), an application function (AF), anetwork repository function (NRF), and so on. For instance, in such anetwork, application server (AS) 145 of FIG. 1 may represent anapplication function (AF) for determining settings for parameters of aradio access network via a reinforcement learning agent comprising aplurality of sub-agents, and for performing various other operations inaccordance with the present disclosure. In addition, any one or more ofcell sites 111-113 may comprise 2G, 3G, 4G and/or LTE radios, e.g., inaddition to 5G new radio (NR) functionality. For instance, innon-standalone (NSA) mode architecture, LTE radio equipment may continueto be used for cell signaling and management communications, while userdata may rely upon a 5G new radio (NR), including millimeter wavecommunications, for example. Thus, these and other modifications are allcontemplated within the scope of the present disclosure.

FIG. 2 illustrates an example graph 200 (e.g., a graph database)representing a telecommunication network, in accordance with the presentdisclosure. For instance, graph 200 may represent telecommunicationservice provider network 170 of FIG. 1. As illustrated in FIG. 2, thegraph 200 may be organized according to a schema that emphasizeshierarchical relationships among objects (e.g., nodes/vertices)representing components or aspects of the telecommunication network. Forinstance, a first portion 210 of the graph 200 illustrates ahierarchical relationship with a first tier associated with a networkzone, e.g., an Evolved Packet Core (EPC) zone and/or a network slice, asecond tier associated with individual cells, a third tier associatedwith cell sectors, and a fourth tier associated with antennas, or remoteradio heads (RRHs), where each of the objects at a respective tierrepresents a zone/EPC network slice, cell, sector, or antenna/RRH,respectively. It should be noted that the foregoing is just one exampleof a hierarchical structure for at least a portion of the graph 200relating to cellular infrastructure of the telecommunication network.For instance, in other, further, and different examples, more or lesstiers may be utilized. For example, a tier for antennas may be omitted,and details regarding antennas/RRHs may be captured in the graph as“properties” of sector objects.

As another example, graph 200 may include a second portion 220 having ahierarchical structure in which a first tier is associated with cloudregions (of the telecommunication network), a second tier associatedwith rack tenants, a third tier associated with servers (e.g., withineach rack), and a fourth tier associated with virtual machines (VMs)and/or virtual network functions (VNFs) hosted on the servers. Forillustrative purposes, a third portion 230 of the graph 200 isillustrated in a hierarchical structure and may be reflective of aphysical architecture of cellular network infrastructure or SDNinfrastructure. As further illustrated in FIG. 2, the graph 200 furtherincludes a fourth portion 240 having a non-hierarchical structure, whichmay be reflective of physical links among geographically distributeddata centers, layer 1 optical networking components (e.g., opticaladd-drop multiplexers, optical transport links, optical transceivers ortransponders, etc.), and so forth. Insofar as a telecommunicationnetwork may be a multifaceted system (for example, a cellular networkmay include cloud-RAN infrastructure, such as vMMEs, vSGWs, etc., andmay use optical transport infrastructure for backhaul and links amongcore network components that may be geographically distributed), itshould be noted that the portions 210-240 of the graph 200 are notnecessarily isolated data structures (or “silos”). Thus, forillustrative purposes, various possible “relationships” or links amongobjects in the different portions 210-240 are omitted from specificrepresentation in the graph 200 of FIG. 2. However, it should beunderstood that such “relationships” can and may in fact exist in agraph that is representative of a telecommunication network.

As further illustrated in FIG. 2, a more detailed view of the portion210 is shown. For instance, a first tier object is for “zone/EPC networkslice ID 8.” For instance, different cellular network zones, or EPCslices may be defined by identifiers (IDs). As further illustrated, theobject for “zone/EPC network slice ID 8” has several properties,including “capacity,” “call setup failure ratio,” “call failure ratio,”and “average cell availability.” These properties may be aggregated fromdifferent cells within the zone and may comprise state information thatmay be obtained in the same or similar manner as described above inconnection with the example of FIG. 1. At a second tier, there is anobject for “cell ID 12345.” This object has properties of “location,”“status,” “handover setting,” “cell tag status,” “scheduling algorithm,”“call fail ratio,” and “average cell availability.” It should be notedthat some of these properties may comprise current settings for variousconfigurable parameters, while others may comprise performanceindicators that may be measured and monitored, but which cannot becontrolled directly.

The link between the object (also referred to as a node or vertex) for“zone/EPC network slice ID 8” and the object for “cell ID 12345”comprises a “relationship” which may be one of several types ofrelationships that are defined according to a schema for the graph, suchas “is a member of,” “is a component of,” “is controlled by,” “isassigned to,” “is connected to,” etc. In this case, the relationshipbetween “zone/EPC network slice ID 8” and the object for “cell ID 12345”is: “is a member of.” In one example, relationships may also haveproperties. For instance, this particular relationship has theproperties of “date created” and “creator ID.” For example, certaincomponents or configurations of the telecommunication network may becreated by network operations personnel or automated systems, each ofwhich may be assigned a creator identifier (CID). Thus, for example, anetwork slice may be created by a network operations personnel having aCID 5, who may have configured the cell having cell ID 12345 to be amember of the zone/EPC slice having ID 8.

Other objects and relationships, and the properties thereof are as shownin FIG. 2. As also depicted in FIG. 2, in addition to a hierarchy of azone/EPC network slice object and cell objects for cells that aremembers of the zone, there may be objects for EPC components, such asthe object for a mobility management entity (MME), e.g., “MME ID 74532.”This object may have various properties relating to configurableparameters and performance indicators. This object also hasrelationships with cell objects and the zone/EPC network slice object.For instance, the relationship with the object for “cell ID 12345”indicates an “is assigned to” relation between the objects. In otherwords, the cell having cell ID 12345 is assigned to the MME having MMEID 74532. The relationship was created on Jan. 1, 2020 by an entityassigned CID 5. For instance, CID 5 may correspond to a SDN controllerwhich may have created MME having MME ID 74532 and assigned the cellhaving cell ID 12235 to be associated with this particular MME. Althoughthis association may be implied by the illustrated hierarchy, thisspecific relationship is included in the example portion 210 of graph200 to demonstrate that the present disclosure is not limited to aparticular schema for a graph representing a telecommunication network(such as a purely hierarchical structure).

FIG. 3 illustrates an example state exploration process 300 inaccordance with the present disclosure. For instance, as illustrated inFIG. 3, the state exploration process may have several inputs 310,including an existing state (e.g., an existing state of thetelecommunication network which may be characterized or represented by agraph, such as the graph 200 of FIG. 2 (and which may be derived fromnetwork topology information, configuration settings, and/or performanceindicators, such as described above)). In one example, for purposes ofthe state exploration process 300, network states may be definedaccording to logical expressions which are evaluated over variousaspects of state information of the graph. In the present example, the“existing state” is evaluated and determined to be “preprocessed”according to the logical expression which defines the network state of“preprocessed.” Continuing with the present example, another one of theinputs 310 is the “intent,” which in this case may comprise “energysavings,” and which may be quantified as a network state of “optimized”(indicating sleep-optimized).

Additional inputs 310 include the available policies, comprising actionswhich may be taken in the communication network (and which may besimulated or evaluated in the state exploration process 300). As notedabove, each of the properties has a precondition and post-condition,which may be defined as a logical expression comprising a predicate on adomain represented by the graph (a Boolean expression with variablescomprising information taken from the graph (e.g., representing networkstate)) or a literal on a the domain represented by the graph (an atomicformula (or its negation) (which can be a predicate symbol applied toterms/variables comprising information taken from the graph)).

As illustrated in FIG. 3, the state exploration process begins in stateS₀ (the existing state, which may comprise a current state or amost-recently evaluated network state of the telecommunication networkas represented by the graph), which is “preprocessed.” At phase P₀,policies from the policy pool are considered for application/executionwithin the telecommunication network. In this case, the policies“CellTag” and “CellReconfig” are considered at phase P₀. Notably, thesepolicies have preconditions corresponding to the state “preprocessed”while other policies in the policy pool have preconditions which are notsatisfied. Specifically, “tagged(cell)” and “tagged(sector)” are notevaluable to “true” and thus, preconditions for “SectorTag” and“SleepOpt” are not met.

States S₁ represent the results of taking the actions corresponding topolicies “CellTag” and “CellReconfig” (as well as the choice of applyingno policy/taking no action). Notably, the resulting states S₁ from“CellTag” and “CellReconfig” policies are quantified by the respectivepost-conditions of “tagged(cell)” and “˜tagged(cell)” as indicated bythe respective policy “signatures.” Each of the states S₁ is then takenas a starting point for consideration of possible policies to apply atphase P₁ (or choices of applying no policy/taking no action). In thiscase, “CellTag” and “CellReconfig” remain possible policies to applyfrom the “preprocessed” state. There are no policies that may be appliedfrom the “˜tagged(cell)” state. However, the “SectorTag” policy may nowbe applied since the precondition of “tagged(cell)” is true according toone of the states in S₁.

States S₂ represent the results of taking the actions corresponding topolicies illustrated at P₁ (as well as the choices of applying nopolicy/taking no action from respective states in S₁). In this case,“CellTag” and “CellReconfig” remain possible policies to apply from the“preprocessed” state, and “SectorTag” remains a policy that may beapplied from the “tagged(cell)” state. There remain no policies that maybe applied from the “˜tagged(cell)” state. However, the “SleepOpt”(sleep optimize) policy may now be applied since the precondition of“tagged(sector)” is true according to one of the states in S₂. States S₃represent the results of taking the actions corresponding to policiesillustrated at P₂ (as well as the choices of applying no policy/takingno action from respective states in S₂).

Notably, one of the resulting states in S₃ is “optimized,” which is thepost-condition of the policy “SleepOpt”, and which is the state thatdefines the high-level intent of “energy savings.” In this case, thestate exploration process 300 may end since the state corresponding tothe intent has been reached, starting from the existing state. Inparticular, the set/sequence of policies (1) “CellTag”, (2) “SectorTag”,and (3) “SleepOpt” may be returned as a result comprising a strategy tofulfill the intent, given the existing state and the set of availablepolicies in the policy pool. It should be noted that the foregoing isjust one example of how state exploration may proceed in accordance witha graph representing a telecommunication network (to provide states, ormore specifically “network states”), a policy pool having policiesdefined as predicates and/or literals over the domain comprising thegraph, and a set of available intents from which an intent may beselected. For instance, the state exploration process may be implementedvia a satisfiability modulo theories (SMT) solver, such as StanfordResearch Institute Problem Solver (STRIPS), a CVC3 solver, a CVC4solver, a SATPLAN solver, a BLACKBOX solver, a Graphplan solver, or thelike.

In addition, in one example, a plurality of costs may be assigned toeach of the plurality of policies, where when the state explorationprocess 300 identifies a plurality of sequences of state transitions toobtain the desired network state from the existing network state, thecomposing of the strategy may comprise selecting a least-cost sequencefrom the plurality of sequences. For instance, multiple sequences/pathsmay be found via the state exploration process 300 that may result inthe desired network state according to the intent. Thus, the stateexploration process 300 may include selecting from among the possiblesolutions. In another example, all of the possible solutions may bepresented to a user for selection among the choices. For instance, therespective solutions and their associated costs may be presented to theuser. In addition, in one example, the user may select from differentcost models, and the respective costs may be re-evaluated and/or updatedto reflect the selected cost model, after which the user may select fromamong the respective solutions. For instance, according to differentcost models, a “cost” may comprise a monetary cost, a time cost, anenergy utilization cost, etc., or a cost measure comprising a compositeof any of the foregoing factors, or different factors. Thus, these andother modifications are all contemplated within the scope of the presentdisclosure.

FIG. 4 illustrates, a flowchart of an example method 400 forimplementing a plurality of policies according to a strategy composed inaccordance with a state exploration process to place a telecommunicationnetwork in a desired network state. In one example, steps, functionsand/or operations of the method 400 may be performed by a device asillustrated in FIG. 1, e.g., by AS 145 or network controller 102, and/oror any one or more components thereof, or by AS 145 or networkcontroller 102, and/or any one or more components thereof in conjunctionwith one or more other components of the system 100, such as one or moreof AS 145, network controller 102, cell sites 111-113, BBU pool 114, andso forth. In one example, the steps, functions, or operations of method400 may be performed by a computing device or processing system, such ascomputing system 500, and/or a hardware processor element 502 asdescribed in connection with FIG. 5 below. For instance, the computingsystem 500 may represent at least a portion of an application server orother device(s) in accordance with the present disclosure. Forillustrative purposes, the method 400 is described in greater detailbelow in connection with an example performed by a processing system. Inone example, the steps, functions, or operations of method 400 may beperformed by a processing system comprising a plurality of suchcomputing devices as represented by the computing system 500. The method400 begins in step 405 and may proceed to optional step 410 or to step430.

At optional step 410, the processing system may obtain or create a graphrepresenting a telecommunication network. For instance, the graph maycomprise a plurality of objects and a plurality of relationships orlinks representing a plurality of associations between the plurality ofobjects, where each of the plurality of objects comprises one or moreproperties (e.g., settings for configurable parameters, performanceindicators, and/or other data comprising information about the object,such as the date created and/or deployed, the creating or authorizingentity, a model number, a software version, a manufacturer identifier,or other non-configurable, fixed, or relatively fixed characteristics).To illustrate, the graph may be derived from an A&AI system and may beenhanced with additional state information obtained from thetelecommunication network, such as described above. In accordance withthe present disclosure, each of the plurality of objects may representone of: a physical network function, a virtual network function, or anetwork zone. For instance, physical network functions may comprisephysical components of an access network portion of thetelecommunication network, physical components of a core network portionof the telecommunication network, etc. Similarly, virtual networkfunctions may comprise virtual components of an access network portionof the telecommunication network or virtual components of a core networkportion of the telecommunication network.

In one example, each of the plurality of relationships represents aphysical link in the telecommunication network or a hierarchicalrelationship among at least two of the plurality of objects. Forinstance, hierarchical relationships that may be represented in thegraph include: a first object of the plurality of objects being acomponent of a second object of the plurality of objects, the firstobject of the plurality objects being hosted on a second object of theplurality of objects, the first object of the plurality of objects beingmanaged by the second object of the plurality of objects, etc.

In one example, the plurality of relationships may also include othertypes of relationships, such as logical communicative relationships. Forinstance, a relationship may comprise “is a peer of,” and may representa tunnel, or label-switched path between two routers via aMulti-Protocol Label Switching (MPLS) network architecture. It should benoted that in some examples, physical links, such as fiber optic cables,may alternatively or additionally be represented as “objects” (ornodes/vertices) in the graph (e.g., as an alternative or in addition tobeing represented via one or more “relationships” or edges/links in thegraph).

At optional step 420, the processing system may obtain policies andintents that may be utilized in accordance with the example method 400.For instance, the policies and intents may be obtained from devices ofnetwork operations personnel who may be tasked with provisioning suchpolicies and intents. In one example, the policies may comprise actionsthat may be implemented by the processing system via thetelecommunication network (e.g., settings that may be selected forconfigurable parameters of various components of the telecommunicationnetwork, and which may be effected via instructions to variouscomponents, either directly, such as via vendor APIs for respectivecomponents, via a network controller or the like, and so forth). In oneexample, each of the plurality of policies has a precondition and apost-condition. For instance, each of the preconditions andpost-conditions may be defined as logical expression comprising apredicate on a domain represented by the graph or a literal on thedomain represented by the graph. In addition, each of the plurality ofpolicies may comprise an atomic action or a plurality of sub-policiescomprising a set of actions to be performed as a group. The intents maycomprise predefined intents, which are goals that may be achieved viautilization of multiple policies. In one example, the intents may bedefined by a desired network state (e.g., characteristics of thetelecommunication network) as represented by a state of the graphrepresenting the telecommunication network. In one example, the intentsmay also be defined by a level of the intent, such asconservative-moderate-aggressive, a range of levels 1-5, etc.

At step 430, the processing system obtains a selection of an intentcomprising a desired network state for a telecommunication network. Inone example, the desired network state is defined in accordance with agraph that represents the telecommunication network, where the graphcomprises a plurality of objects and a plurality of relationships orlinks/edges between the plurality of objects, and where each of theplurality of objects comprises one or more properties. For instance, theintent may be one of a plurality of available intents that are madeavailable and from which a user may select an intent. For example, aspresented to the user, the intents may be, for example: “energysavings,” “coverage optimization,” “traffic offload,” “blacklisting,”“safe-guard,” “reboot,” and so forth. However, from the perspective ofthe processing system and for purposes of the state exploration processto follow at step 450, the intents may comprise the desired networkstates defined in accordance with the graph.

At step 440, the processing system determines an existing network stateof the telecommunication network, where the existing network state isalso defined in accordance with the graph that represents thetelecommunication network. For instance, the processing system mayobtain and/or may maintain the graph which is representative of acurrent state, a recent network state, a most-recently evaluated networkstate of the telecommunication network, etc. (e.g., the “existingnetwork state”).

At step 450, the processing system composes a strategy comprising aplurality of policies to obtain the desired network state from theexisting network state. As noted above, each of the plurality ofpolicies may comprise an action that may be implemented in thetelecommunication network. In one example, step 450 comprises performinga state exploration process over the graph, where each state transitionof the state exploration process corresponds to an application of apolicy of the plurality of policies. For instance, the plurality ofpolicies may include a preprocess policy, a cell tag policy, a cellreconfiguration policy, a sector tag policy, a sleep optimizationpolicy, and so forth. In one example, the state exploration process maybe implemented via a satisfiability modulo theories (SMT) solver.

In one example, the state exploration process comprises identifying afirst group of policies from among the plurality of policies havingpreconditions that are satisfied by the existing network state andsimulating respective actions of each of the first group of policies,where the simulating comprises modifying the graph from the existingnetwork state in accordance with respective post-conditions of the firstgroup of policies, and which results in the generation of a firstplurality of modified graphs representing a first plurality of simulatednetwork states for the telecommunication network. For instance, in oneexample, the state exploration process of step 450 may be in accordancewith the example of FIG. 3. Thus, for example, the foregoing actions maycorrespond to phase P₀ and may result in the states at S₁.

The state exploration process of step 450 may further includeidentifying a second group of policies from among the plurality ofpolicies having preconditions that are satisfied by a respectivesimulated network state of the first plurality of network states that isrepresented by the at least one of the first plurality of modifiedgraphs, and simulating respective actions of each of the second group ofpolicies. For instance, the simulating may comprise modifying at leastone of the first plurality of modified graphs from the respectivesimulated network state in accordance with respective post-conditions ofthe second group of policies. In addition, the simulating may generate asecond plurality of modified graphs representing a second plurality ofsimulated network states for the telecommunication network. Forinstance, in an example relating to the state exploration process 300 ofFIG. 3, the foregoing actions may correspond to phase P₁, and may resultin the states at S₂. Step 450 may include further operations of the sameor a similar nature for subsequent phases until a simulated networkstate is obtained that comprises the desired network state. Forinstance, the state exploration process may end when a simulated networkstate is obtained that comprises the desired network state.

The path via the state exploration process that results in the desirednetwork state may then be selected for composing a strategy to achievethe desired network state from the existing network state. For instance,composing the strategy may include selecting at least a first policyfrom the first group of policies and a second policy from the secondgroup of policies for the strategy, where simulated actions of the atleast the first policy and the second policy comprise a sequence ofstate transitions that resulted in the desired network state from theexisting network state. For instance, in the illustrative example ofFIG. 3, the state transitions may comprise a transition from the stateat S₀ (e.g., “preprocessed”) to one of the states in S₁ (e.g.,“tagged(cell)”), a transition from the “tagged(cell)” state in S₁ to the“tagged(sector)” state in S₂, and a transition from the “tagged(sector)”state in S₂ to the desired network state “optimized” in S₃. Thus, insuch an example, the path may include the set/sequence of policies (1)“CellTag,” (2) “SectorTag,” and (3) “SleepOpt.”

In one example, the state exploration process of step 450 may findmultiple paths that reach the desired network state. In such case, step450 may include making a selection among the options comprising themultiple paths, or may include presenting the paths as options to auser, from among which the user may select a particular path as astrategy for implementation to fulfill the selected intent. In oneexample, one or more costs may be assigned to each of the plurality ofpolicies, where when the state exploration process identifies aplurality of sequences of state transitions to obtain the desirednetwork state from the existing network state, the composing of thestrategy may comprise selecting a least-cost sequence from the pluralityof sequences. In another example, all of the possible solutions may bepresented to a user for selection among the choices. For instance, therespective solutions and their associated costs may be presented to theuser. In addition, in one example, the user may select from differentcost models, and the respective costs may be re-evaluated and/or updatedto reflect the selected cost model, after which the user may select fromamong the respective solutions.

At step 460, the processing system implements the plurality of policiesaccording to the strategy, where the implementing is to place thetelecommunication network in the desired network state. For instance,the processing system may communicate with cell sites, core networkcomponents, etc., and/or one or more components thereof, such aseNodeB's, remote radio heads (RRHs), BBU pools, host devices, VMs, andso forth via various control interfaces (e.g., vendor APIs) to remotelyadjust settings for various configurable parameters in accordance withthe policies/actions. Alternatively, or in addition, the processingsystem may communicate with a network controller to provide one or moreinstructions to implement the set of policies, where the networkcontroller may communicate with various components of thetelecommunication network in the same or a similar manner.

Following step 460, the method 400 proceeds to step 495. At step 495,the method 400 ends.

It should be noted that the method 400 may be expanded to includeadditional steps, or may be modified to replace steps with differentsteps, to combine steps, to omit steps, to perform steps in a differentorder, and so forth. For instance, in one example the processing systemmay repeat one or more steps of the method 400 with respect toadditional intents. In one example, the method 400 may be expanded toinclude obtaining new or additional policies or intents. In one example,the method 400 may be expanded to include obtaining updated networkstate information (e.g., parameters settings that may be adjusted insome other way, such as manual configurations outside of the bounds ofthe method 400, adjustments automatically made by or via a SDNcontroller and/or SON orchestrator, performance indicator measurementsreflective of changes in the telecommunication network, and so forth.Thus, these and other modifications are all contemplated within thescope of the present disclosure.

In addition, although not expressly specified above, one or more stepsof the example method 400 may include a storing, displaying and/oroutputting step as required for a particular application. In otherwords, any data, records, fields, and/or intermediate results discussedin the method(s) can be stored, displayed and/or outputted to anotherdevice as required for a particular application. Furthermore,operations, steps, or blocks in FIG. 4 that recite a determiningoperation or involve a decision do not necessarily require that bothbranches of the determining operation be practiced. In other words, oneof the branches of the determining operation can be deemed as anoptional step. However, the use of the term “optional step” is intendedto only reflect different variations of a particular illustrativeembodiment and is not intended to indicate that steps not labelled asoptional steps to be deemed to be essential steps. Furthermore,operations, steps or blocks of the above described method(s) can becombined, separated, and/or performed in a different order from thatdescribed above, without departing from the example embodiments of thepresent disclosure.

FIG. 5 depicts a high-level block diagram of a computing system 500(e.g., a computing device or processing system) specifically programmedto perform the functions described herein. For example, any one or morecomponents or devices illustrated in FIG. 1 or described in connectionwith the examples of FIGS. 2-4 may be implemented as the computingsystem 500. As depicted in FIG. 5, the computing system 500 comprises ahardware processor element 502 (e.g., comprising one or more hardwareprocessors, which may include one or more microprocessor(s), one or morecentral processing units (CPUs), and/or the like, where hardwareprocessor element may also represent one example of a “processingsystem” as referred to herein), a memory 504, (e.g., random accessmemory (RAM), read only memory (ROM), a disk drive, an optical drive, amagnetic drive, and/or a Universal Serial Bus (USB) drive), a module 505for implementing a plurality of policies according to a strategycomposed in accordance with a state exploration process to place atelecommunication network in a desired network state, and variousinput/output devices 506, e.g., a camera, a video camera, storagedevices, including but not limited to, a tape drive, a floppy drive, ahard disk drive or a compact disk drive, a receiver, a transmitter, aspeaker, a display, a speech synthesizer, an output port, and a userinput device (such as a keyboard, a keypad, a mouse, and the like).

Although only one hardware processor element 502 is shown, it should benoted that the computing device may employ a plurality of hardwareprocessor elements. Furthermore, although only one computing device isshown in the Figure, if the method(s) as discussed above is implementedin a distributed or parallel manner for a particular illustrativeexample, i.e., the steps of the above method(s) or the entire method(s)are implemented across multiple or parallel computing devices, e.g., aprocessing system, then the computing device of this Figure is intendedto represent each of those multiple computers. Furthermore, one or morehardware processors can be utilized in supporting a virtualized orshared computing environment. The virtualized computing environment maysupport one or more virtual machines representing computers, servers, orother computing devices. In such virtualized virtual machines, hardwarecomponents such as hardware processors and computer-readable storagedevices may be virtualized or logically represented. The hardwareprocessor element 502 can also be configured or programmed to causeother devices to perform one or more operations as discussed above. Inother words, the hardware processor element 502 may serve the functionof a central controller directing other devices to perform the one ormore operations as discussed above.

It should be noted that the present disclosure can be implemented insoftware and/or in a combination of software and hardware, e.g., usingapplication specific integrated circuits (ASIC), a programmable logicarray (PLA), including a field-programmable gate array (FPGA), or astate machine deployed on a hardware device, a computing device, or anyother hardware equivalents, e.g., computer readable instructionspertaining to the method(s) discussed above can be used to configure ahardware processor to perform the steps, functions and/or operations ofthe above disclosed method(s). In one example, instructions and data forthe present module or process 505 for implementing a plurality ofpolicies according to a strategy composed in accordance with a stateexploration process to place a telecommunication network in a desirednetwork state (e.g., a software program comprising computer-executableinstructions) can be loaded into memory 504 and executed by hardwareprocessor element 502 to implement the steps, functions or operations asdiscussed above in connection with the example method 400. Furthermore,when a hardware processor executes instructions to perform “operations,”this could include the hardware processor performing the operationsdirectly and/or facilitating, directing, or cooperating with anotherhardware device or component (e.g., a co-processor and the like) toperform the operations.

The processor executing the computer readable or software instructionsrelating to the above described method(s) can be perceived as aprogrammed processor or a specialized processor. As such, the presentmodule 505 for implementing a plurality of policies according to astrategy composed in accordance with a state exploration process toplace a telecommunication network in a desired network state (includingassociated data structures) of the present disclosure can be stored on atangible or physical (broadly non-transitory) computer-readable storagedevice or medium, e.g., volatile memory, non-volatile memory, ROMmemory, RAM memory, magnetic or optical drive, device or diskette andthe like. Furthermore, a “tangible” computer-readable storage device ormedium comprises a physical device, a hardware device, or a device thatis discernible by the touch. More specifically, the computer-readablestorage device may comprise any physical devices that provide theability to store information such as data and/or instructions to beaccessed by a processor or a computing device such as a computer or anapplication server.

While various embodiments have been described above, it should beunderstood that they have been presented by way of example only, and notlimitation. Thus, the breadth and scope of a preferred embodiment shouldnot be limited by any of the above-described example embodiments, butshould be defined only in accordance with the following claims and theirequivalents.

What is claimed is:
 1. A method comprising: obtaining, by a processingsystem including at least one processor, a selection of an intentcomprising a desired network state for a telecommunication network;determining, by the processing system, an existing network state of thetelecommunication network, wherein the desired network state and theexisting network state are defined in accordance with a graph thatrepresents the telecommunication network, wherein the graph comprises aplurality of objects and a plurality of relationships between theplurality of objects, and wherein each of the plurality of objectscomprises one or more properties; composing, by the processing system, astrategy comprising a plurality of policies to obtain the desirednetwork state from the existing network state, wherein each of theplurality of policies comprises an action that is to be implemented inthe telecommunication network, wherein the composing comprisesperforming a state exploration process over the graph, and wherein eachstate transition of a plurality of state transitions of the stateexploration process corresponds to a policy of the plurality ofpolicies, wherein each of the plurality of policies has a preconditionand a post-condition, and wherein the state exploration processcomprises: identifying a first group of policies from among theplurality of policies having preconditions that are satisfied by theexisting network state; and simulating a respective action of each ofthe first group of policies, wherein the simulating comprises modifyingthe graph from the existing network state in accordance with respectivepost-conditions of the first group of policies, wherein the simulatinggenerates a first plurality of modified graphs representing a firstplurality of simulated network states for the telecommunication network;and implementing, by the processing system, the plurality of policiesaccording to the strategy, wherein the implementing is to place thetelecommunication network in the desired network state.
 2. The method ofclaim 1, wherein each of the plurality of objects represents one of: aphysical network function; a virtual network function; or a networkzone.
 3. The method of claim 2, wherein the physical network functioncomprises: a physical component of an access network portion of thetelecommunication network; or a physical component of a core networkportion of the telecommunication network.
 4. The method of claim 2,wherein the virtual network function comprises: a virtual component ofan access network portion of the telecommunication network; or a virtualcomponent of a core network portion of the telecommunication network. 5.The method of claim 1, wherein each of the plurality of relationshipsrepresents one of: a physical link in the telecommunication network; ora hierarchical relationship among at least two of the plurality ofobjects.
 6. The method of claim 5, wherein the hierarchical relationshipcomprises: a first object of the plurality of objects being a componentof a second object of the plurality of objects; the first object of theplurality objects being hosted on the second object of the plurality ofobjects; or the first object of the plurality of objects being managedby the second object of the plurality of objects.
 7. The method of claim1, wherein the preconditions are determined to be satisfied from anetwork state according to the graph.
 8. The method of claim 7, whereinthe state exploration process further comprises, for at least one of thefirst plurality of modified graphs: identifying a second group ofpolicies from among the plurality of policies having preconditions thatare satisfied by a respective simulated network state of the firstplurality of network states that is represented by the at least one ofthe first plurality of modified graphs; and simulating a respectiveaction of each of the second group of policies, wherein the simulatingcomprises modifying at least one of the first plurality of modifiedgraphs from the respective simulated network state in accordance withrespective post-conditions of the second group of policies, wherein thesimulating generates a second plurality of modified graphs representinga second plurality of simulated network states for the telecommunicationnetwork.
 9. The method of claim 8, wherein the state exploration processends when a simulated network state is obtained that comprises thedesired network state.
 10. The method of claim 9, wherein the stateexploration process assigns at least one cost to each of the pluralityof policies, wherein when the state exploration process identifies aplurality of sequences of state transitions to obtain the desirednetwork state from the existing network state, the composing of thestrategy comprises selecting a least-cost sequence from the plurality ofsequences.
 11. The method of claim 9, wherein the composing of thestrategy comprises: selecting at least a first policy from the firstgroup of policies and a second policy from the second group of policiesfor the strategy, wherein simulated actions of the at least the firstpolicy and the second policy comprise a sequence of state transitionsthat result in the desired network state from the existing networkstate.
 12. The method of claim 1, wherein each of the precondition andpost-condition is defined as a logical expression comprising: apredicate on a domain represented by the graph; or a literal on thedomain represented by the graph.
 13. The method of claim 1, wherein theplurality of policies includes two or more of: a preprocess policy; acell tag policy; a cell reconfiguration policy; a sector tag policy; ora sleep optimization policy.
 14. The method of claim 1, wherein theintent comprises one of: an energy savings intent; a traffic offloadintent; a blacklisting intent; a safe-guard intent; or a reboot intent.15. The method of claim, 1, wherein the intent includes a level of theintent.
 16. The method of claim 1, wherein each of the plurality ofpolicies comprises: an atomic action; or a plurality of sub-policiescomprising a set of actions to be performed as a group.
 17. Anon-transitory computer-readable medium storing instructions which, whenexecuted by a processing system including at least one processor, causethe processing system to perform operations, the operations comprising:obtaining a selection of an intent comprising a desired network statefor a telecommunication network; determining an existing network stateof the telecommunication network, wherein the desired network state andthe existing network state are defined in accordance with a graph thatrepresents the telecommunication network, wherein the graph comprises aplurality of objects and a plurality of relationships between theplurality of objects, and wherein each of the plurality of objectscomprises one or more properties; composing a strategy comprising aplurality of policies to obtain the desired network state from theexisting network state, wherein each of the plurality of policiescomprises an action that is to be implemented in the telecommunicationnetwork, wherein the composing comprises performing a state explorationprocess over the graph, and wherein each state transition of a pluralityof state transitions of the state exploration process corresponds to apolicy of the plurality of policies, wherein each of the plurality ofpolicies has a precondition and a post-condition, and wherein the stateexploration process comprises: identifying a first group of policiesfrom among the plurality of policies having preconditions that aresatisfied by the existing network state; and simulating a respectiveaction of each of the first group of policies, wherein the simulatingcomprises modifying the graph from the existing network state inaccordance with respective post-conditions of the first group ofpolicies, wherein the simulating generates a first plurality of modifiedgraphs representing a first plurality of simulated network states forthe telecommunication network; and implementing the plurality ofpolicies according to the strategy, wherein the implementing is to placethe telecommunication network in the desired network state.
 18. Anapparatus comprising: a processing system including at least oneprocessor; and a computer-readable medium storing instructions which,when executed by the processing system, cause the processing system toperform operations, the operations comprising: obtaining a selection ofan intent comprising a desired network state for a telecommunicationnetwork; determining an existing network state of the telecommunicationnetwork, wherein the desired network state and the existing networkstate are defined in accordance with a graph that represents thetelecommunication network, wherein the graph comprises a plurality ofobjects and a plurality of relationships between the plurality ofobjects, and wherein each of the plurality of objects comprises one ormore properties; composing a strategy comprising a plurality of policiesto obtain the desired network state from the existing network state,wherein each of the plurality of policies comprises an action that is tobe implemented in the telecommunication network, wherein the composingcomprises performing a state exploration process over the graph, andwherein each state transition of a plurality of state transitions of thestate exploration process corresponds to a policy of the plurality ofpolicies, wherein each of the plurality of policies has a preconditionand a post-condition, and wherein the state exploration processcomprises: identifying a first group of policies from among theplurality of policies having preconditions that are satisfied by theexisting network state; and simulating a respective action of each ofthe first group of policies, wherein the simulating comprises modifyingthe graph from the existing network state in accordance with respectivepost-conditions of the first group of policies, wherein the simulatinggenerates a first plurality of modified graphs representing a firstplurality of simulated network states for the telecommunication network;and implementing the plurality of policies according to the strategy,wherein the implementing is to place the telecommunication network inthe desired network state.
 19. The apparatus of claim 18, wherein eachof the plurality of objects represents one of: a physical networkfunction; a virtual network function; or a network zone.
 20. Theapparatus of claim 19, wherein the physical network function comprises:a physical component of an access network portion of thetelecommunication network; or a physical component of a core networkportion of the telecommunication network.